Temporal Discretization

Temporal discretization is a mathematical technique applied to transient problems that occur in the fields of applied physics and engineering.

Transient problems are often solved by conducting simulations using computer-aided engineering (CAE) packages, which require discretizing the governing equations in both space and time. Such problems are unsteady (e.g. flow problems), and therefore require solutions in which position varies as a function of time. Temporal discretization involves the integration of every term in different equations over a time step ($\Delta t$).

The spatial domain can be discretized to produce a semi-discrete form:
$\frac(x,t) = F(\varphi).~$

If the discretization is done using backward differences, the first-order temporal discretization is given as:Selection of Spatial and Temporal discretization
/ref>
$\frac = F(\varphi),$

And the second-order discretization is given as:
$\frac = F(\varphi),$
where
* $\varphi$ is a scalar quantity.
* $n + 1$ is the value at the next time level, $t + \Delta t$.
* $n$ is the value at the current time level, $t$.
* $n - 1$ is the value at the previous time level, $t - \Delta t$.

The function $F(\varphi)$ is evaluated using implicit- and explicit-time integration.

Description

The temporal discretization is done through integration over time on the general discretized equation. First, values at a given control volume $P$ at time interval $t$ are assumed and then value at time interval $t + \Delta t$ is found. This method states that the time integral of a given variable is equal to a weighted average between current and future values. The integral form of the equation can be written as:
$\frac = f\cdot F( \varphi^) + (1-f) \cdot F( \varphi^n ),$
where $f$ is a weight between 0 and 1.

* $f = 0.0$ results in the fully explicit scheme.
* $f = 1.0$ results in the fully implicit scheme.
* $f = 0.5$ results in the Crank-Nicolson scheme.

For any control volume this integration holds true for any discretized variable. The following equation is obtained when applied to the governing equation including full discretized diffusion, convection, and source terms.
\int_t^ F(\varphi) \, dt = f\cdot F_\varphi^ + (1-f)\cdot F_\varphi^t \, \Delta t

Methods for evaluating function ''F''(''φ'')

After discretizing the time derivative, function $F(\varphi)$ remains to be evaluated. The function is now evaluated using implicit and explicit-time integration.Jirka Simunek
/ref>

Implicit-time integration

This methods evaluates the function $F(\varphi)$ at a future time.

Formulation

The evaluation using implicit-time integration is given as:
$\frac = F( \varphi^ ),$

This is called implicit integration as $\varphi^$ in a given cell is related to $\varphi^$ in neighboring cells through $F(\varphi^)$:
$\varphi^ = \varphi^n + \Delta t F( \varphi^ ),$

In case of implicit method, the setup is unconditionally stable and can handle large time step ($\Delta t$). But, stability doesn't mean accuracy. Therefore, large $\Delta t$ affects accuracy and defines time resolution. But, behavior may involve physical timescale that needs to be resolved.

Explicit-time integration

This methods evaluates the function $F(\varphi)$ at a current time.

Formulation

The evaluation using explicit-time integration is given as:
$\frac = F(\varphi^n),$

And is referred as explicit integration since $\varphi^$ can be expressed explicitly in the existing solution values, $\varphi^$:
$\varphi^ = \varphi^n + \Delta t \, F( \varphi^n ),$

Here, the time step ($\Delta t$) is restricted by the stability limit of the solver (i.e., time step is limited by the Courant–Friedrichs–Lewy condition). To be accurate with respect to time the same time step should be used in all the domain, and to be stable the time step must be the minimum of all the local time steps in the domain. This method is also referred to as "global time stepping".

Examples

Many schemes use explicit-time integration. Some of these are as follows:

* Lax–Wendroff method
* Runge–Kutta method

See also

* Courant–Friedrichs–Lewy condition.
* Von Neumann stability analysis.
* Finite element method
* Explicit and implicit methods
* Chi-Wang Shu

References

{{reflist

Computer-aided engineering